Recognizing Chordal Graphs: Lex BFS and MCS1
نویسندگان
چکیده
منابع مشابه
Recognizing Chordal-Bipartite Probe Graphs
A graph G is chordal-bipartite probe if its vertices can be partitioned into two sets P (probes) and N (non-probes) where N is a stable set and such thatG can be extended to a chordal-bipartite graph by adding edges between non-probes. A bipartite graph is called chordal-bipartite if it contains no chordless cycle of length strictly greater than 5. Such probe/non-probe completion problems have ...
متن کاملMaximum Cardinality Search for Computing Minimal Triangulations
We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. Lex-BFS, a seminal algorithm for recognizing chordal graphs, was the genesis for two other classical algorithms: Lex-M and MCS. Lex-M extends the fundamental concept used in Lex-BFS, resulting in an algorithm that also computes a minimal triangulation of an arbitrary graph. MCS simplified the fundamental c...
متن کاملRecognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs
A graph G = (V,E) is a chordal probe graph if its vertices can be partitioned into two sets, P (probes) and N (non-probes), where N is a stable set and such that G can be extended to a chordal graph by adding edges between non-probes. We give several characterizations of chordal probe graphs, first, in the case of a fixed given partition of the vertices into probes and non-probes, and second, i...
متن کاملNC Algorithms for Recognizing Chordal Graphs and k Trees
We present parallel algorithms for recognizing the chordal graphs and k trees. Under the model of computation PRAM with concurrent reading and writing allowed, these algorithms take O(log n) time and require O(n4) processors. Our algorithms have an improved processor-bound than an independent result by Edenbrandt for recognizing chordal graphs in parallel using O(n3m) processors. Furthermore, o...
متن کاملFast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
In this paper, we present a linear-time algorithm for substitution decomposition on chordal graphs. Based on this result, we develop a linear-time algorithm for transitive orientation on chordal comparability graphs, which reduces the complexity of chordal comparability recognition from O(n) to O(n+m). We also devise a simple linear-time algorithm for interval graph recognition where no complic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formalized Mathematics
سال: 2006
ISSN: 1898-9934,1426-2630
DOI: 10.2478/v10037-006-0022-z